منابع مشابه
Exceptional Surgery and Boundary Slopes
Let X be a norm curve in the SL(2,C)-character variety of a knot exterior M . Let t = ‖β‖/‖α‖ be the ratio of the Culler-Shalen norms of two distinct non-zero classes α, β ∈ H1(∂M,Z). We demonstrate that either X has exactly two associated strict boundary slopes ±t, or else there are strict boundary slopes r1 and r2 with |r1| > t and |r2| < t. As a consequence, we show that there are strict bou...
متن کاملLower Bounds for Alternating Online State Complexity
The notion of Online State Complexity, introduced by Karp in 1967, quantifies the amount of states required to solve a given problem using an online algorithm, which is represented by a deterministic machine scanning the input from left to right in one pass. In this paper, we extend the setting to alternating machines as introduced by Chandra, Kozen and Stockmeyer in 1976: such machines run ind...
متن کاملAlternating-time temporal logic with resource bounds
Many problems in AI and multi-agent systems research are most naturally formulated in terms of the abilities of a coalition of agents. There exist several excellent logical tools for reasoning about coalitional ability. However, coalitional ability can be affected by the availability of resources, and there is no straightforward way of reasoning about resource requirements in logics such as Coa...
متن کاملTight Security Bounds for Key-Alternating Ciphers
A t-round key-alternating cipher (also called iterated Even-Mansour cipher) can be viewed as an abstraction of AES. It defines a cipher E from t fixed public permutations P1, . . . , Pt : {0, 1} → {0, 1} and a key k = k0‖ · · · ‖kt ∈ {0, 1} by setting Ek(x) = kt⊕Pt(kt−1⊕Pt−1(· · · k1⊕P1(k0⊕ x) · · · )). The indistinguishability of Ek from a truly random permutation by an adversary who also has ...
متن کاملLower Bounds for Alternating Online Space Complexity
The notion of online space complexity, introduced by Karp in 1967, quantifies the amount of space required to solve a given problem using an online algorithm, represented by a Turing machine which scans the input exactly once from left to right. In this paper, we study alternating algorithms as introduced by Chandra, Kozen and Stockmeyer in 1976. We devise a lower bound technique relying on bou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algebraic & Geometric Topology
سال: 2017
ISSN: 1472-2739,1472-2747
DOI: 10.2140/agt.2017.17.2603